Entry into force of the UN Watercourses Convention: why should it matter?

The United Nations Watercourses Convention entered into force on 17 August 2014, following a long and complex journey that dates back to 1970 when the UN referred the matter to its legal arm, the International Law Commission. This article follows the Convention through that long and turbulent road, examines its main provisions and analyses the reasons for the delay of its entry into force. It concludes by answering the question of why entry into force of the Convention should indeed matter.     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

WCDMA系统接口信令消息的描述与实现

WCDMA作为第三代移动通信系统的主流标准，能够提供多种类型的多媒体服务。为了实现各种用户平面数据的传输，系统会提前通过控制平面对所需的无线资源进行分配。由于配置过程是通过接口之间发送控制平面应用协议消息来实现的，因此能否正确有效地对信令消息进行编解码成为保证系统稳定工作的关键因素。3GPP标准中，ASN．1语言被用来描述接口信令消息。首先简要介绍了WCDMA系统结构以及主要接口协议，重点描述了ASN．1存在的意义及其编解码规则，最后给出了基于ASN．1的开发环境下应用层网络协议的开发流程。     

Data structure and algorithms for fast automatic differentiation

In this paper we discuss the data structure and algorithms for the direct application of generalized Leibnitz rules to the numerical computation of partial derivatives in forward mode. The proposed data structure provides constant time access to the partial derivatives, which accelerates the automatic differentiation computations. The interaction among elements of the data structure is explained by several numerical examples. The paper contains analysis of the developed data structure and algorithms. Copyright © 2003 John Wiley & Sons, Ltd.     

基于小波变换的不同融合规则的图像融合研究

图像融合是一种重要的增强图像信息的方法。提出了一种基于多尺度分解的像素图像融合方法。利用小波变换按照不同融合规则及融合算子构造融合图像对应的小波系数。通过对可见光图像与红外图像进行融合的实验比较表明，以像素的局部能量为准则的融合效果更好，既可避免传统融合规则的信息损失，又提高了融合图像的空间分辨率和清晰度，融合图像更符合人的视觉特性，也有利于机器视觉。     

Implicit Leadership Theories in Applied Settings: Factor Structure, Generalizability, and Stability Over Time.

The present empirical investigation had a 3-fold purpose: (a) to cross-validate L. R. Offermann, J. K. Kennedy, and P. W. Wirtz's (1994) scale of Implicit Leadership Theories (ILTs) in several organizational settings and to further provide a shorter scale of ILTs in organizations; (b) to assess the generalizability of ILTs across different employee groups, and (c) to evaluate ILTs' change over time. Two independent samples were used for the scale validation (N1 = 500 and N2 = 439). A 6-factor structure (Sensitivity, Intelligence, Dedication, Dynamism, Tyranny, and Masculinity) was found to most accurately represent ELTs in organizational settings. Regarding the generalizability of ILTs, although the 6-factor structure was consistent across different employee groups, there was only partial support for total factorial invariance. Finally, evaluation of gamma, beta, and alpha change provided support for ILTs' stability over time. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Numerical Study of a Modified Time-Stepping θ-Scheme for Incompressible Flow Simulations

In [Turek (1996). Int. J. Numer. Meth. Fluids 22, 987–1011], we had performed numerical comparisons for different time stepping schemes for the incompressible Navier–Stokes equations. In this paper, we present the numerical analysis in the context of the Navier–Stokes equations for a modified time-stepping θ-scheme which has been recently proposed by Glowinski [Glowinski (2003). In: Ciarlet, P. G., and Lions, J. L. (eds.), Handbook of Numerical Analysis, Vol. IX, North-Holland, Amsterdam, pp. 3–1176]. Like the well-known classical Fractional-Step-θ-scheme which had been introduced by Glowinski [Glowinski (1985). In Murman, E. M. and Abarbanel, S. S. (eds.), Progress and Supercomputing in Computational Fluid Dynamics, Birkh?user, Boston MA; Bristeau et al. (1987). Comput. Phys. Rep. 6, 73–187], too, and which is still one of the most popular time stepping schemes, with or without operator splitting techniques, this new scheme consists of 3 substeps with nonequidistant substepping to build one macro time step. However, in contrast to the Fractional-Step-θ-scheme, the second substep can be formulated as an extrapolation step for previously computed data only, and the two remaining substeps look like a Backward Euler step so that no expensive operator evaluations for the right hand side vector with older solutions, as for instance in the Crank–Nicolson scheme, have to be performed. This modified scheme is implicit, strongly A-stable and second order accurate, too, which promises some advantageous behavior, particularly in implicit CFD simulations for the nonstationary Navier–Stokes equations. Representative numerical results, based on the software package FEATFLOW [Turek (2000). FEATFLOW Finite element software for the incompressible Navier–Stokes equations: User Manual, Release 1.2, University of Dortmund] are obtained for typical flow problems with benchmark character which provide a fair rating of the solution schemes, particularly in long time simulations.Dedicated to David Gottlieb on the occasion of his 60th anniversary     

Mining process models with non-free-choice constructs

Process mining aims at extracting information from event logs to capture the business process as it is being executed. Process mining is particularly useful in situations where events are recorded but there is no system enforcing people to work in a particular way. Consider for example a hospital where the diagnosis and treatment activities are recorded in the hospital information system, but where health-care professionals determine the “careflow.” Many process mining approaches have been proposed in recent years. However, in spite of many researchers’ persistent efforts, there are still several challenging problems to be solved. In this paper, we focus on mining non-free-choice constructs, i.e., situations where there is a mixture of choice and synchronization. Although most real-life processes exhibit non-free-choice behavior, existing algorithms are unable to adequately deal with such constructs. Using a Petri-net-based representation, we will show that there are two kinds of causal dependencies between tasks, i.e., explicit and implicit ones. We propose an algorithm that is able to deal with both kinds of dependencies. The algorithm has been implemented in the ProM framework and experimental results shows that the algorithm indeed significantly improves existing process mining techniques.     

Building a user model implicitly from a cooperative advisory dialog

This paper reviews existing methods for building user models to support adaptive, interactive systems, identifies sigificant problems with these approaches, and describes a new method for implicitly acquiring user models from an ongoing user-system dialog. Existing explicit user model acquisition methods, such as user edited models or model building dialogs put additional burden on the user and introduce artificial model acquisition dialogs. Hand coding stereotypes, another explicit acquisition method, is a tedious and error-prone process. On the other hand, implicit acquisition techniques such as computing presuppositions or entailments either draw too few inferences to be generally useful, or too many to be trusted.In contrast, this paper describes GUMAC, a General User Model Acquisition Component that uses heuristic rules to make default inferences about users' beliefs from their interaction with an advisory expert system. These rules are based on features of human action and conversation that constrain people's behavior and establish expectations about their knowledge. The application of these rules is illustrated with two examples of extended dialogs between users and an investment advisory system. During the course of these conversations, GUMAC is able to acquire an extensive model of the users' beliefs about the aspects of the domain considered in the dialog. These models, in turn, provide the sort of information needed by an explanation generator to tailor explanations the advisory system gives to its users.